Bottom up parsing as abstract interpretation of operational semantics
نویسنده
چکیده
We show that LR(k) parsers can be represented as abstract interpretation of Shift-Reduce parser.
منابع مشابه
Grammar semantics, analysis and parsing by abstract interpretation
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problems, classical grammar flow analysis algorithm...
متن کاملGrammar Analysis and Parsing by Abstract Interpretation
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problem, classical grammar flow analysis algorithms...
متن کاملDRAFT Linear Logical Approximations ∗
The abstract interpretation of programs relates the exact semantics of a programming language to an approximate semantics that can be effectively computed. We show that, by specifying operational semantics in a bottom-up, linear logic programming language – a technique we call substructural operational semantics (SSOS) – manifestly sound program approximations can be derived by simple and intui...
متن کاملAn Abstract Interpretation Framework for Semantics and Diagnosis of Lazy Functional-Logic Languages
interpretation [29, 31], a technique for constructing verified analyses of program execution behavior, has been extensively applied to logic programming [57, 67, 44, 23]. The relevant feature of abstract interpretation is that, once the property intended to be observed has been modeled by an abstract domain, we have a methodology to systematically derive an abstract semantics, which in turn all...
متن کاملParsing with Typed Feature Structures
In this paper we provide for parsing with respect to grammars expressed in a general TFS-based formalism, a restriction of ALE. Our motivation being the design of an abstract (WAM-like) machine for the formalism, we consider parsing as a computational process and use it as an operational semantics to guide the design of the control structures for the abstract machine. We emphasize the notion of...
متن کامل